The Number of Perfect Matchings in (3,6)-Fullerene
نویسندگان
چکیده
A [see formula in PDF]-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons, has the connectivity PDF] or PDF]. The PDF]-fullerenes with tubes consisting of concentric hexagonal layers such that each layer consists two capped on end by adjacent triangles, denoted vertices exactly perfect matchings. structure can be determined three parameters PDF], and[see thus we denote it where radius (number rings), size spokes layer, even), torsion ([see PDF]). In this paper, counting matchings PDF]is given, number obtained. Therefore, correctness conclusion every bridgeless at least proposed Esperet et al verified for
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint) and replacing each edge by a randomly chosen perfect matching between the n-sets corresponding to the endpoints of the edge. Let XG be the number of perfect matchings in a random lift of G. We study the distribution o...
متن کاملThe number of maximal matchings in polyphenylene chains
A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...
متن کاملOn the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets
Let P and Q be disjoint point sets with 2k and 2l elements respectively, and M1 and M2 be their minimum weight perfect matchings (with respect to edge lengths). We prove that the edges of M1 and M2 intersect at most |M1| + |M2| − 1 times. This bound is tight. We also prove that P and Q have perfect matchings (not necessarily of minimum weight) such that their edges intersect at most min{r, s} t...
متن کاملSome perfect matchings and perfect half-integral matchings in NC
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wuhan University Journal of Natural Sciences
سال: 2023
ISSN: ['1007-1202', '1993-4998']
DOI: https://doi.org/10.1051/wujns/2023283192